Codegree Turán Density of Complete $r$-Uniform Hypergraphs
نویسندگان
چکیده
منابع مشابه
Codegree Thresholds for Covering 3-Uniform Hypergraphs
Given two 3-uniform hypergraphs F and G = (V,E), we say that G has an F -covering if we can cover V with copies of F . The minimum codegree of G is the largest integer d such that every pair of vertices from V is contained in at least d triples from E. Define c2(n, F ) to be the largest minimum codegree among all n-vertex 3-graphs G that contain no F -covering. Determining c2(n, F ) is a natura...
متن کاملTurán Problems on Non-Uniform Hypergraphs
A non-uniform hypergraph H = (V,E) consists of a vertex set V and an edge set E ⊆ 2V ; the edges in E are not required to all have the same cardinality. The set of all cardinalities of edges in H is denoted by R(H), the set of edge types. For a fixed hypergraph H, the Turán density π(H) is defined to be limn→∞maxGn hn(Gn), where the maximum is taken over all H-free hypergraphs Gn on n vertices ...
متن کاملRainbow H-Factors of Complete s-Uniform r-Partite Hypergraphs
We say a s-uniform r-partite hypergraph is complete, if it has a vertex partition {V1, V2, . . . , Vr} of r classes and its hyperedge set consists of all the s-subsets of its vertex set which have at most one vertex in each vertex class. We denote the complete s-uniform r-partite hypergraph with k vertices in each vertex class by Ts,r(k). In this paper we prove that if h, r and s are positive i...
متن کاملExtremal hypergraphs and bounds for the Turán density of the 4-uniform K5
In this paper we find, for n ≤ 16, the maximum number of edges in a 4-uniform hypergraph which does not have the complete 4-uniform hypergraph on five vertices,K4 5 , as a subgraph. Equivalently, we find all optimal (n, n−4, n−5) covering designs for n ≤ 16. Using these results we find a new upper bound for the Turán density ofK4 5 . π(K4 5 ) ≤ 1753 2380 = 0.73655 . . . . Finally wemake some no...
متن کاملThe density Turán problem for some 3-uniform unihypercyclic linear hypergraphs An efficient testing algorithm
Let H = (V, E) be a 3-uniform linear hypergraph with one hypercycle C3. We consider a blow-up hypergraph B[H]. We are interested in the following problem. We have to decide whether there exists a blow-up hypergraph B[H] of the hypergraph H, with hyperedge densities satisfying special conditions, such that the hypergraph H appears in a blow-up hypergraph as a transversal. We present an efficient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2018
ISSN: 0895-4801,1095-7146
DOI: 10.1137/18m1163956